| 1. | a clique of a simple graph α is a subset s of ν.
简单图的一个团是指中的一个子集s。 |
| 2. | The number of i - claw k - independent sets of a simple graph is reconstructible
爪独立集个数的可重构性 |
| 3. | A sufficient condition to decide a simple graph with a complete subgraph
简单图含有完全子图的一个充分条件 |
| 4. | Let g be a finite simple graph
G是有限简单图。 |
| 5. | Let g be a simple graph
G是有限简单图。 |
| 6. | And give exact values of bw ( g ) for four types of graphs . a upper bound of bw ( g ) for every connected simple graph g . the main results are as follows : propsition 2 . 2 if n > 6 , then bw ( pn ) = 1
在图弱控制的束缚数中，对树t给出其b _ w ( t )的上紧界；另对四类常见图类g给出b _ w ( g )的精确值。 |
| 7. | In this paper , we establish some relations between the eigenvalues and matching number , diameter , and the number of quasi - pendant vertices of mixed graphs , which extend some known result of simple graphs on eigenvalues distribution
建立了混和图的特征值与匹配数、直径以及拟悬挂点数的关系,推广了简单图上若干关于特征值分布的结论 |
| 8. | Abstract : in this paper we servey some recent trands of applications of the method of algebraic topology to simple graphs . some fundamental concepts are introduced with theorems . several new problems are proposed
文摘:我们从组合拓扑方法在图论的应用中,着重介绍与图有关的几种复形的近期研究动态,论述其中一些带基础性的问题,并提出一些可供研究的新问题 |
| 9. | At last , we correct several mistakes in a paper written by pinar dundar . in chapter 3 , the concept of vertex - neighbor - scattering number of graphs is introduced , and the values of vertex - neighbor - scattering number of some simple graphs are given
第三章引入图的邻域离散数概念，给出几类基本图的邻域离散数值，并就树的邻域离散数进行较为深入的研究。 |
| 10. | Let a graph g is a simple graph of order n . a graph of order n is called pancyclic if it contains cycles of every length l , 3 < l < n , and is called weakly pancyclic if it contains cycles of all lengths between its girth and circumference
设g是n阶简单图，如果对于任意的整数l ： 3 l n ， g中含有长度为l的圈，则称g为泛圈图；如果g中含有长度在围长和周长之间的所有圈，则称g是弱泛圈图。 |
